semigroup of subsets

См. также в других словарях:

• Semigroup — This article is about the algebraic structure. For applications to differential equations, see C0 semigroup. In mathematics, a semigroup is an algebraic structure consisting of a set together with an associative binary operation. A semigroup… …   Wikipedia

• Numerical semigroup — In mathematics, a numerical semigroup is a special kind of a semigroup. Its underlying set is the set of all nonnegative integers except a finite number and the binary operation is the operation of addition of integers. Also, the integer 0 must… …   Wikipedia

• Munn semigroup — In mathematics, the Munn semigroup is built from an arbitrary semilattice E. Contents 1 Construction s steps 2 Theorem 3 Example 4 References …   Wikipedia

• Inverse semigroup — In mathematics, an inverse semigroup S is a semigroup in which every element x in S has a unique inverse y in S in the sense that x = xyx and y = yxy. Inverse semigroups appear in a range of contexts; for example, they can be employed in the… …   Wikipedia

• Monoid — This article is about the mathematical concept. For the alien creatures in the Doctor Who adventure, see The Ark (Doctor Who). Coherence law for monoid unit In abstract algebra, a branch of mathematics, a monoid is an algebraic structure with a… …   Wikipedia

• Free monoid — In abstract algebra, the free monoid on a set A is the monoid whose elements are all the finite sequences (or strings) of zero or more elements from A , with the binary operation of concatenation. It is usually denoted A lowast;. The identity… …   Wikipedia

• Special classes of semigroups — In mathematics, a semigroup is a nonempty set together with an associative binary operation. A special class of semigroups is a class of semigroups satisfying additional properties or conditions. Thus the class of commutative semigroups consists… …   Wikipedia

• Ordinal optimization — In mathematical optimization, ordinal optimization is the maximization of functions taking values in a partially ordered set ( poset ). Ordinal optimization has applications in the theory of queuing networks. Contents 1 Mathematical foundations 1 …   Wikipedia

• Green's relations — In mathematics, Green s relations are five equivalence relations that characterise the elements of a semigroup in terms of the principal ideals they generate. The relations are named for James Alexander Green, who introduced them in a paper of… …   Wikipedia

• Series (mathematics) — A series is the sum of the terms of a sequence. Finite sequences and series have defined first and last terms, whereas infinite sequences and series continue indefinitely.[1] In mathematics, given an infinite sequence of numbers { an } …   Wikipedia

• Ping-pong lemma — In mathematics, the ping pong lemma, or table tennis lemma, is any of several mathematical statements which ensure that several elements in a group acting on a set freely generate a free subgroup of that group.HistoryThe ping pong argument goes… …   Wikipedia